An Efficient Strategy for Word-Cycle Completion in Finitely Presented Groups
نویسندگان
چکیده
We present an efficient strategy for the application of the inference rules of a completion procedure for finitely presented groups. This procedure has been proposed by Cremanns and Otto and uses a combinatorial structure called word-cycle. Our strategy is complete in the sense that a set of persistent word-cycles can be used to solve the reduced word problem of the finitely presented group given as input. This procedure has been implemented in order to experiment with various examples of groups.
منابع مشابه
PATCH Graphs: An Efficient Data Structure for Completion of Finitely Presented Groups
Based on a new data structure called PATCH Graph, an eecient completion procedure for nitely presented groups is described. A PATCH Graph represents rules and their symmetrized forms as cycles in a Cayley graph structure. Completion is easily performed directly on the graph, and structure sharing is enforced. The structure of the graph allows us to avoid certain redundant inferences. The PATCH ...
متن کاملEnergy Efficiency Analyses of Toolpaths in a Pocket Milling Process
This paper presents an approach to analytically determine the most energy efficient toolpath strategy in mechanical machining. This was achieved by evaluating the electrical energy requirement of the NC codes generated for the zag, zigzag, and rectangular contour toolpath strategies. The analytical method was validated by performing pocket milling on AISI 1018 steel with the considered toolpath...
متن کاملTuring Degrees and the Word and Conjugacy Problems for Finitely Presented Groups
The unsolvability of the conjugacy problem for finitely presented groups was first shown by Novikov [26]. Shortly thereafter the corresponding result for the word problem was proved by Novikov [27] and Boone [6] (see also Boone [7], Higman [20] and Britton [9]). Friedberg [19] and Mucnik [25] revitalised the theory of recursively enumerable (r.e.) Turing degrees by showing that there are degree...
متن کاملSubgroups of Word Hyperbolic Groups in Dimension 2
If G is a word hyperbolic group of cohomological dimension 2, then every subgroup of G of type FP2 is also word hyperbolic. Isoperimetric inequalities are denned for groups of type FP2 and it is shown that the linear isoperimetric inequality in this generalized context is equivalent to word hyperbolicity. A sufficient condition for hyperbolicity of a general graph is given along with an applica...
متن کاملEnumeration in algebra
We show how the concept of enumeration reducibility from computability theory may be applied to obtain computability conditions on descriptions of substructures of algebras, more prominently on the language of forbidden words of a subshift, and on the word problem for finitely generated groups. Many of the results here are already known for recursively presented groups and effectively closed su...
متن کامل